Implementing Complex Krylov Solvers with Minimal Pain

نویسنده

  • Michael A. Heroux
چکیده

Most algorithms used in preconditioned iterative methods are generally applicable to complex valued linear systems, with real valued linear systems simply being a special case. However, most iterative solver packages available today focus exclusively on real valued systems, or deal with complex valued systems as an afterthought. One obvious approach to addressing this problem is to recast the complex problem into one of a several equivalent real forms and then use a real valued solver to solve the related system. However, well-known theoretical results showing unfavorable spectral properties for the equivalent real forms have diminished enthusiasm for this approach. At the same time, our experience has shown us that there are situations where using an equivalent real form can be very eeective. In this paper, we explore this approach, giving both theoretical and experimental evidence that an equivalent real form can be useful for a number of practical situations. Furthermore, we show that by making good use of some of the advance features of modern solver packages , we can easily generate equivalent real form preconditioners that are computationally eecient and mathematically identical to their complex counterparts. Using our techniques, we are able to solve very ill-conditioned complex valued linear systems for a variety of large scale applications. However, more importantly, we shed more light on the eeectiveness of equivalent real forms and more clearly delineate how and when they should be used.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How to compute Green’s Functions for entire Mass Trajectories within Krylov Solvers

The availability of efficient Krylov subspace solvers play a vital role for the solution of a variety of numerical problems in computational science. Here we consider lattice field theory. We present a new general numerical method to compute many Green’s functions for complex non-singular matrices within one iteration process. Our procedure applies to matrices of structure A = D −m, with m prop...

متن کامل

Efficient nonlinear solvers for Laplace-Beltrami smoothing of three-dimensional unstructured grids

The Laplace-Beltrami system of nonlinear, elliptic, partial differential equations has utility in the generation of computational grids on complex and highly curved geometry. Discretization of this system using the finite element method accommodates unstructured grids, but generates a large, sparse, ill-conditioned system of nonlinear discrete equations. The use of the Laplace-Beltrami approach...

متن کامل

Solution of Dense Systems of Linear Equations Arising from Integral Equation Formulations

|This paper discusses eecient solution of dense systems of linear equations arising from integral equation formulations. Several preconditioners in connection with Krylov iterative solvers are examined and compared with LU factorization. Results are shown demonstrating practical aspects and issues we have encountered in implementing iterative solvers on both parallel and sequential computers.

متن کامل

DELFT UNIVERSITY OF TECHNOLOGY REPORT 07-09 A Minimal Residual Method for Shifted Skew-Symmetric Systems

We describe the MRS solver, a Minimal Residual method based on the Lanczos algorithm that solves problems from the important class of linear systems with a shifted skew-symmetric coefficient matrix using short vector recurrences. The MRS solver is theoretically compared with other Krylov solvers and illustrated by some numerical experiments.

متن کامل

Newton–Raphson preconditioner for Krylov type solvers on GPU devices

A new Newton-Raphson method based preconditioner for Krylov type linear equation solvers for GPGPU is developed, and the performance is investigated. Conventional preconditioners improve the convergence of Krylov type solvers, and perform well on CPUs. However, they do not perform well on GPGPUs, because of the complexity of implementing powerful preconditioners. The developed preconditioner is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999